First Attempts to Combine Symmetry Reduction and Heuristic Search for Error Detection

نویسنده

  • Alberto Lluch Lafuente
چکیده

The state explosion problem is the main limitation of model checking. Symmetries in the system being veriied can be exploited in order to avoid this problem. A symmetry relation on the system is deened, which induces a semantically equivalent quotient system of smaller size. On the other hand, heuristic search algorithms can be applied to improve error detection. Such algorithms use heuristic functions to guide the exploration. Best-rst is used for accelerating the search, while A* guarantees optimal error trails if combined with admissible estimates. We analyze some aspects of combining both approaches, presenting an admissible estimate that allows A* to provide optimal counterexamples when combined with symmetry reduction. Experimental results are also included.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetry Reduction and Heuristic Search for Error Detection in Model Checking

The state explosion problem is the main limitation of model checking. Symmetries in the system being verified can be exploited in order to avoid this problem by defining an equivalence (symmetry) relation on the states of the system, which induces a semantically equivalent quotient system of smaller size. On the other hand, heuristic search algorithms can be applied to improve the bug finding c...

متن کامل

Etude des symétries dans les modèles finis

Finite modele search for first order logic theories is a complementary alternative to automated deduction. Systems like Falcon, SEM and FMSET use the LNH(Least Number Heuristic) heuristic to eliminate some trivial symmetries. Such symmetries are worthful, but their exploitation is limited to the first levels of the model search tree, since they desappear as soon as the first cells have been ins...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A New Method for Intrusion Detection Using Genetic Algorithm and Neural Network

    The article attempts to have neural network and genetic algorithm techniques present a model for classification on dataset. The goal is design model can the subject acted a firewall in network and this model with compound optimized algorithms create reliability and accuracy and reduce error rate couse of this is article use feedback neural network and compared to previous methods increase a...

متن کامل

A New Method for Intrusion Detection Using Genetic Algorithm and Neural Network

    The article attempts to have neural network and genetic algorithm techniques present a model for classification on dataset. The goal is design model can the subject acted a firewall in network and this model with compound optimized algorithms create reliability and accuracy and reduce error rate couse of this is article use feedback neural network and compared to previous methods increase a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007